Internal DLA in Higher Dimensions

نویسندگان

  • David Jerison
  • Lionel Levine
  • Scott Sheffield
چکیده

Let A(t) denote the cluster produced by internal diffusion limited aggregation (internal DLA) with t particles in dimension d ≥ 3. We show that A(t) is approximately spherical, up to an O( √ log t) error. In the process known as internal diffusion limited aggregation (internal DLA) one constructs for each integer time t ≥ 0 an occupied set A(t) ⊂ Zd as follows: begin with A(0) = ∅ and A(1) = {0}. Then, for each integer t > 1, form A(t + 1) by adding to A(t) the first point at which a simple random walk from the origin hits Zd \A(t). Let Br ⊂ Rd denote the ball of radius r centered at 0, and write Br := Br ∩ Zd. Let ωd be the volume of the unit ball in Rd. Our main result is the following. Theorem 1. Fix an integer d ≥ 3. For each γ there exists an a = a(γ, d) < ∞ such that for all sufficiently large r, P { Br−a √ log r ⊂ A(ωdr ) ⊂ Br+alog r }c ≤ r−γ . We treated the case d = 2 in [JLS12] (see also the overview in [JLS09]), where we obtained a similar statement with log r in place of √ log r. Together with a Borel-Cantelli argument, these results in particular imply the following: let D(r) be the Hausdorff distance between the ball Br and the set A(ωdr d) + [−12 , 1 2 ] d centered at points of the internal DLA cluster. Then Corollary 2. For each d ≥ 2 there is a constant a = a(d) such that P {D(r) ≤ a(log r) eventually} = 1 ∗Partially supported by NSF grant DMS-1069225. †Partially supported by NSF grants DMS-0803064 and DMS-1243606. ‡Partially supported by NSF grant DMS-0645585.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A DLA model for Turbulence

A connection between fractal dimensions of ”turbulent facets”, and fractal dimensions in DLA is shown.

متن کامل

Internal Diffusion-Limited Aggregation: Parallel Algorithms and Complexity

The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of predicting the cluster from a given set of paths is complete for the complexity class CC, the subset of P characterized by circuits composed of comparator gates. CC-completeness is believed to impl...

متن کامل

Iterated conformal dynamics and Laplacian growth.

The method of iterated conformal maps for the study of diffusion limited aggregates (DLA) is generalized to the study of Laplacian growth patterns and related processes. We emphasize the fundamental difference between these processes: DLA is grown serially with constant size particles, while Laplacian patterns are grown by advancing each boundary point in parallel, proportional to the gradient ...

متن کامل

Number of branches in diffusion-limited aggregates: The skeleton.

We develop the skeleton algorithm to define the number of main branches Nb of diffusion-limited aggregation (DLA) clusters. The skeleton algorithm provides a systematic way to remove dangling side branches of the DLA cluster and has successfully been applied to study the ramification properties of percolation. We study the skeleton of comparatively large (≈ 10 sites) off-lattice DLA clusters in...

متن کامل

Statistical Physics: 12/28/95 MULTIFRACTAL DIMENSIONS FOR BRANCHED GROWTH

A recently proposed theory for diffusion-limited aggregation (DLA), which models this system as a random branched growth process, is reviewed. Like DLA, this process is stochastic, and ensemble averaging is needed in order to define multifractal dimensions. In an earlier work [T.C. Halsey and M. Leibig, Phys. Rev. A 46, 7793 (1992)], annealed average dimensions were computed for this model. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010